Sparse matrices in frame theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Matrices in Frame Theory

Frame theory is closely intertwined with signal processing by providing a canon of methodologies for the analysis of signals using (redundant) linear measurements. The dual frame associated with a frame then provides a means for reconstruction by a least squares approach. The novel paradigm of sparsity entered this area lately in various ways. Of those, in this survey paper, we will focus on th...

متن کامل

On Slanted Matrices in Frame Theory

In this paper we present a brief account of the use of the spectral theory of slanted matrices in frame and sampling theory. Some abstract results on slanted matrices are also presented.

متن کامل

Sparse Signal Processing with Frame Theory

Many emerging applications involve sparse signals, and their processing is a subject of active research. We desire a large class of sensing matrices which allow the user to discern important properties of the measured sparse signal. Of particular interest are matrices with the restricted isometry property (RIP). RIP matrices are known to enable efficient and stable reconstruction of sufficientl...

متن کامل

Sparse Stable Matrices

In the design of decentralized networked systems, it is useful to know whether a given network topology can sustain stable dynamics. We consider a basic version of this problem here: given a vector space of sparse real matrices, does it contain a stable (Hurwitz) matrix? Said differently, is a feedback channel (corresponding to a non-zero entry) necessary for stabilization or can it be done wit...

متن کامل

Sketching Sparse Matrices

This paper considers the problem of recovering an unknown sparse p× p matrix X from an m ×m matrix Y = AXBT , where A and B are known m × p matrices with m p. The main result shows that there exist constructions of the “sketching” matrices A and B so that even if X has O(p) non-zeros, it can be recovered exactly and efficiently using a convex program as long as these non-zeros are not concentra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2013

ISSN: 0943-4062,1613-9658

DOI: 10.1007/s00180-013-0446-1